Regression verification for automated evaluation of students programs
نویسندگان
چکیده
منابع مشابه
Regression Verification for Multi-threaded Programs
Regression verification is the problem of deciding whether two similar programs are equivalent under an arbitrary yet equal context, given some definition of equivalence. So far this problem has only been studied for the case of single-threaded deterministic programs. We present a method for regression verification of multi-threaded programs. Specifically, we develop a proof-rule whose premise ...
متن کاملOn Automated Verification of Probabilistic Programs
We introduce a simple procedural probabilistic programming language which is suitable for coding a wide variety of randomised algorithms and protocols. This language is interpreted over finite datatypes and has a decidable equivalence problem. We have implemented an automated equivalence checker, which we call apex, for this language, based on game semantics. We illustrate our approach with thr...
متن کاملAutomated verification of programs and Web systems
This special issue of the Journal of Logical and Algebraic Methods in Programming (JLAMP) is organised around the themes of the 10th International Workshop on Automated Specification and Verification of Web Systems (WWV) and the 2nd International Workshop on Verification and Program Transformation (VPT), both of which took place during the Vienna Summer of Logic on July 17th and 18th, 2014. The...
متن کاملAutomated Verification of Relational While-Programs
Software verification is essential for safety-critical systems. In this paper, we illustrate that some verification tasks can be done fully automatically. We show how to automatically verify imperative programs for relation-based discrete structures by combining relation algebra and the well-known assertion-based verification method with automated theorem proving. We present two examples in det...
متن کاملAutomated Behavioural Verification of Prolog Programs
Execution of a Procedure Let p c1; : : : ; cr be a procedure. The result Bout of the execution of p with in (where in is the input substitution of some abstract sequence B with hB; sei 2 Behp) is obtained by \concatenating" the results B1; : : : ; Br of the abstract execution of each clause. More precisely, Bout = CONC(B1; : : : ; Br), the last being a shortcut for CONC(: : :CONC(Br 1; Br) : : ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Science and Information Systems
سال: 2020
ISSN: 1820-0214,2406-1018
DOI: 10.2298/csis181220019v